Finite Automata and Isomorphism Types
نویسندگان
چکیده
منابع مشابه
Graph Isomorphism is PSPACE-complete
Combining the the results of A.R. Meyer and L.J. Stockmeyer " The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space " , and K.S. Booth " Iso-morphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems " shows that graph isomorphism is PSPACE-complete. The equivalence problem for regular expressions was shown to be PSPACE-...
متن کاملNondeterministic automata: equivalence, bisimulations, and uniform relations
In this paperwe study the equivalenceofnondeterministic automatapairing the conceptof abisimulationwith the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these...
متن کاملar X iv : 1 10 2 . 54 49 v 1 [ cs . F L ] 2 6 Fe b 20 11 Nondeterministic automata : equivalence , bisimulations , and uniform relations ✩
In this paperwe study the equivalenceofnondeterministic automatapairing the conceptof abisimulationwith the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these...
متن کاملFinite nondeterministic automata: Simulation and minimality
Motivated by recent applications of finite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht–Fräısse-like games to model automata responses and simulations. The minimal automaton is constructed and, in contrast with the classical case, proved to be unique up to an isomorphism. Finally, we in...
متن کاملOn Isomorphism Invariants of Some Automatic Structures
In this paper we study structures defined by finite automata, called automatic structures. We provide a method that reduces the study of automatic structures to the study of automatic graphs. We investigate isomorphism invariants of automatic structures with an emphasis to equivalence relation structures, linearly ordered sets, and permutation structures.
متن کامل